A Games Model of Bunched Implications
نویسندگان
چکیده
A game semantics of the (−−∗,→)-fragment of the logic of bunched implications, BI, is presented. To date, categorical models of BI have been restricted to two kinds: functor category models; and the category Cat itself. The game model is not of this kind. Rather, it is based on Hyland-Ong-Nickau-style games and embodies a careful analysis of the notions of resource sharing and separation inherent in BI. The key to distinguishing between the additive and multiplicative connectives of BI is a semantic notion of separation. The main result of the paper is that the model is fully complete: every finite, total strategy in the model is the denotation of a term of the αλ-calculus, the term language for the fragment of BI under consideration.
منابع مشابه
Ribbon Proofs
We present ‘Ribbon Proofs’, a graphical proof system for the Logic of Bunched Implications (BI). We give the informal, graphical, notation, we formalise the system algebraically and sketch the proof of its soundness and completeness. We discuss the spatial and geometrical nature of the proof system and its relation to BI’s spatial model theory.
متن کاملClassical BI: Its Semantics and Proof Theory
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O’Hearn and Pym’s logic of bunched implications BI. CBI differs from existing bunched logics in that its multiplicative connectives behave classically rather than intuitionistically (including in particular a multiplicative version of classical negation). At the semantic level, CBI-formulas have th...
متن کاملModel checking Demos using PBI: A Simple Approach
[Hay03] defines the non-temporal semantics of a simulation language, Demos, in order to be able to model processes acting on shared resources. It also defines the semantics of a logic, PBI, an extension of the Logic of Bunched Implications [POY02, Pym02, OP99], to query these models. This document describes a simple model checker capable of checking a subclass of PBI formulæ against Demos model...
متن کاملOn Model Checking Boolean BI
The logic of bunched implications (BI), introduced by O’Hearn and Pym, is a substructural logic which freely combines additive and multiplicative implications. Boolean BI (BBI) denotes BI with classical interpretation of additives and its model is the commutative monoid. We show that when the monoid is finitely generated and propositions are recursively defined, or the monoid is infinitely gene...
متن کاملLogic Programming with Bunched Implications (extended Abstract)
We introduce the logic of bunched implications, BI, in which multiplicative (or linear) and additive (or intuitionistic) implications live side-by-side. We provide a truth conditional semantics, a proof theory and a categorical semantics of proofs. We explain how BI arises as a logic of resources and sketch a development of this computational interpretation, which is quite diierent from that of...
متن کامل